Solving the Nonadditive Traac Equilibrium Problem
نویسندگان
چکیده
In this paper we develop an algorithm for solving a version of the (static) traac equilibrium problem in which the cost incurred on each path is not simply the sum of the costs on the arcs that constitute that path. The method we describe is based on the recent NE/SQP algorithm , a fast and robust technique for solving nonlinear complementarity problems. Finally, we present an example that illustrates both the importance of using nonadditive costs and the eeectiveness of the NE/SQP method.
منابع مشابه
The Traffic Equilibrium Problem with Nonadditive Path Costs
In this paper we present a version of the (static) traac equilibrium problem in which the cost incurred on each path is not simply the sum of the costs on the arcs that constitute that path. We motivate this nonadditive version of the problem by describing several situations in which the classic additivity assumption fails. We describe existence and uniqueness conditions for this problem and we...
متن کاملThe Tra c Equilibrium Problem with Nonadditive Path CostsSteven
In this paper we present a version of the (static) traac equilibrium problem in which the cost incurred on a path is not simply the sum of the costs on the arcs that constitute that path. We motivate this nonadditive version of the problem by describing several situations in which the classical additiv-ity assumption fails. We also present an algorithm for solving nonadditive problems that is b...
متن کاملReducing the Idle Time of Parallel Transportation Applications Technical Report Cse-96-004
Transportation engineers use traac equilibrium analysis to study traac and road systems; it is also used for planning purposes. This class of applications are generally computationally-intense and requires signiicant storage because of the large networks. Parallel processing provides the memory and computational power needed to solve these problems in a reasonable amount of time. The most compu...
متن کاملA self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
Gradient projection (GP) algorithm has been shown as an efficient algorithm for solving the traditional traffic equilibrium problem with additive route costs. Recently, GP has been extended to solve the nonadditive traffic equilibrium problem (NaTEP), in which the cost incurred on each route is not just a simple sum of the link costs on that route. However, choosing an appropriate stepsize, whi...
متن کاملA Benders\' Decomposition Based Solution Method for Solving User Equilibrium Problem: Deterministic and Stochastic Cases
The traffic assignment problem is one of the most important problems for analyzing and optimizing the transportation network to find optimal flows. This study presented a new formulation based on a generalized Benders' decomposition approach to solve its important part, i.e. user equilibrium problems, in deterministic and stochastic cases. The new approach decomposed the problem into a master p...
متن کامل